Concerning homogeneity in totally ordered, connected topological space

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Totally Ordered Commutative Semigroups

Let 5( + , < ) be a system consisting of a set S endowed with an associative binary operation + and a total ( = linear = simple) order relation < . The composition + and the relation < may be connected by either or both of the following conditions. MC (Monotone Condition). If a and b are elements of 5 such that ax+y ...

متن کامل

Connected and Hyperconnected Generalized Topological Spaces

A. Csaszar introduced and extensively studied the notion of generalized open sets. Following Csazar, we introduce a new notion hyperconnected. We study some specic properties about connected and hyperconnected in generalized topological spaces. Finally, we characterize the connected component in generalized topological spaces.

متن کامل

Reservation-Based Totally Ordered Multicasting

We present an innovative totally ordered multicast protocol that is based on reservation of buffers at the destinations and intermediate network bridges, rather than on an acknowledgment strategy. By introducing timestamps into the packets and by using a buffer reservation retract scheme, our protocol not only produces a global total order of packets but also solves the deadlock and starvation ...

متن کامل

QoS Preserving Totally Ordered Multicast

This paper studies the Quality of Service QoS guarantees of totally ordered multicast algo rithms The paper shows that totally ordered multicast can coexist with guaranteed predictable delays in certain network models The paper considers two reservation models constant bit rate CBR and variable bit rate VBR For these models the paper presents totally ordered multicast algorithms that preserve t...

متن کامل

Totally Ordered Multicast in Large-Scale Systems

Totally ordered multicast protocols have proved to be extremely useful in supporting fault-tolerant distributed applications. This paper compares the performance of the two main classes of protocols providing total order in large-scale systems: token-site and symmetric protocols. The paper shows that both classes of protocols can exhibit a latency close to 2D, where D is the message transit del...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1963

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1963.13.1417